Quantum gates and circuits
نویسندگان
چکیده
منابع مشابه
Ii. Quantum Gates and Circuits
1 Quantum gates Changes occurring to a quantum state vector can be modeled using a quantum circuit, composed of wires and elementary gates, much as normal electronic circuits are used to describe electrical and mechanical systems. We describe a basic set of quantum gates which are useful, and present several examples illustrating their application, including a circuit which attempts to copy, an...
متن کاملQuantum circuits for general multiqubit gates.
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4(n), and scales more favorably than the p...
متن کاملRepresentation of Quantum Circuits with Clifford and π/8 Gates
In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis {H,P, T}, where H , P and T denote the Hadamard, Phase and π/8 gates, respectively. This basis is known as the standard set and its universality has been shown by Boykin et al. [FOCS ’99]. Our normal form has several nice properties: (i) Every circuit over this basis can easily be transformed in...
متن کاملOn the Role of Hadamard Gates in Quantum Circuits
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a “global Hadamard operation”, i.e. apply a Hadamard operation to every qubit simultaneously. In this model, we discuss complexity bounds (lower-bounding the number of global Hadamard operations) for common quantum algorithms : we illustrate upper...
متن کاملImproved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
سال: 1998
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.1998.0159